- Polynomial Zero-Finding
- Mathematics: PZF
Универсальный русско-английский словарь. Академик.ру. 2011.
Polynomial Zero-Finding
Смотреть что такое "Polynomial Zero-Finding" в других словарях:
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Polynomial ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the … Wikipedia
Zero-product property — In the mathematical areas of algebra and analysis, the zero product property, also known as the zero product rule , is an abstract and explicit statement of the familiar property from elementary mathematics that if the product of two real numbers … Wikipedia
Polynomial long division — In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalised version of the familiar arithmetic technique called long division. It can be done easily by hand,… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… … Wikipedia
Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… … Wikipedia
Wilkinson's polynomial — In numerical analysis, Wilkinson s polynomial is a specific polynomial which was used by James H. Wilkinson in 1963 to illustrate a difficulty when finding the root of a polynomial: the location of the roots can be very sensitive to perturbations … Wikipedia
Square-free polynomial — In mathematics, a square free polynomial is a polynomial with no square factors, i.e, f in F [x] is square free if and only if b^2 mid f for every b in F [x] with non zero degree. This definition implies that no factors of higher order can exist … Wikipedia
Characteristic polynomial — This article is about the characteristic polynomial of a matrix. For the characteristic polynomial of a matroid, see Matroid. For that of a graded poset, see Graded poset. In linear algebra, one associates a polynomial to every square matrix: its … Wikipedia
Complex quadratic polynomial — A complex quadratic polynomial is a quadratic polynomial whose coefficients are complex numbers. Contents 1 Forms 2 Conjugation 2.1 Between forms 2.2 With doubling map … Wikipedia
